Cryptography from tensor problems (draft)

نویسنده

  • Leonard J. Schulman
چکیده

We describe a new proposal for a trap-door one-way function. The new proposal belongs to the “multivariate quadratic” family but the trap-door is different from existing methods, and is simpler. Known quantum algorithms do not appear to help an adversary attack this trap-door. (Beyond the asymptotic square-root-speedup which applies to all oracle search problems.)

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Investigating Methods of Kleptography

Due to the fast development in information and communication technology, new challenging problems appear in the security. So, it is important and vital that the scientific society of our country focuses on research and studies these problems and by providing new proposal try to respond to these critical needs of our country. Hence, our aim in this paper is to study and highlight one of the impo...

متن کامل

Twisted tensor product codes

We present two families of constacyclic linear codes with large automorphism groups. The codes are obtained from the twisted tensor product construction. AMS subject classification: 05E20, 05B25, 11T71, 94B25, 94B27, 51E22, 51E20, 20G40, 14L35

متن کامل

Braid Group Cryptography Preliminary Draft

In the last decade, a number of public key cryptosystems based on combinatorial group theoretic problems in braid groups have been proposed. Our tutorial is aimed at presenting these cryptosystems and some known attacks on them. We start with some basic facts on braid groups and on the Garside normal form of its elements. We then present some known algorithms for solving the word problem in the...

متن کامل

DRAFT DRAFT DRAFT DRAFT DRAFT DRAFT DRAFT DRAFT An Improved Upper Bound for Information Theoretic Private Information Retrieval

The private information retrieval (PIR) primitive has received a significant amount of attention from the scientific community since it was first proposed by Chor et al. with other cryptographic primitives [6, 12] and improved upper bounds [3, 16] have been obtained. In this paper, we continue along this path and give an improved upper bound for information theoretic PIR. Our protocol and proof...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012